Using synchronous tree adjoining grammar to model the typology of bound variable pronouns
نویسندگان
چکیده
This paper presents a novel analysis of bound variable anaphora using Synchronous Tree Adjoining Grammar (STAG), a pairing of a Tree Adjoining Grammar (TAG) for syntax and a TAG for semantics. While a bound variable pronoun can occur at a distance from its binder, as in ‘Every girli believes that shei is intelligent,’ languages vary, though in a limited way, as to how near or far from its binder a bound variable should be. As any dependency between two syntactic objects must be localized to a single predicate domain in TAG, modelling bound variable anaphora in syntax and semantics poses an interesting challenge for STAG. In our analysis, bound variable pronouns are represented as Multi-Component sets in both syntax and semantics, composing in delayed tree-local derivations. This allows us to not only account for variable binding at a distance, but it also allows us to define a single derivational parameter from which observed patterns of bound variable locality can be derived, ruling out unobserved patterns, capturing the range of interpretive possibilities for bound variable pronouns across languages.
منابع مشابه
Binding Variables in English: An Analysis Using Delayed Tree Locality
This paper presents an analysis of bound variable pronouns in English using Synchronous Tree Adjoining Grammar. Bound variables are represented as multi-component sets, composing in delayed tree-local derivations. We propose that the observed anti-locality restriction on English bound variables can be for-malised in terms of a constraint on the delay in the composition of the bound variable mul...
متن کاملA Tree Adjoining Grammar Analysis of the Syntax and Semantics of It-Clefts
In this paper, we argue that in it-clefts as in It was Ohno who won, the cleft pronoun (it) and the cleft clause (who won) form a discontinuous syntactic constituent, and a semantic unit as a definite description, presenting arguments from Percus (1997) and Hedberg (2000). We propose a syntax of it-clefts using Tree-Local MultiComponent Tree Adjoining Grammar and a compositional semantics on th...
متن کاملSynchronous Tree Unification Grammar
This paper presents a novel grammar formalism, Synchronous Tree Unification Grammar (STUG), that borrows ideas from two rather distinct exemplars of tree-based grammar formalisms, namely Synchronous Tree Adjoining Grammar and Tree Unification Grammar. At the same time STUG differs considerably from those in that it allows for a clean separation of syntax and valency. Exploiting this potential i...
متن کاملA Tree Transducer Model for Synchronous Tree-Adjoining Grammars
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, a STAG corresponds to an extended tree transducer that uses explicit substitution in both the input and output. This characterization allows the easy integration of STAG into toolkits for exten...
متن کاملSynchronous Tree Adjoining Machine Translation
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves translation quality without becoming computationally intractable. Using adjoining to model optionality allows general translation patterns to be learned without the clutter of endless variations of optional material. The a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 25 شماره
صفحات -
تاریخ انتشار 2015